Compiling Collapsing Rules

Compiling Collapsing Rules in Certain Constructor Systems

Termination of Rewrite Systems with Shallow Right-Linear, Collapsing, and Right-Ground Rules

We show that termination is decidable for rewrite systems that contain shallow and right-linear rules, collapsing rules, and rightground rules. This class of rewrite systems is expressive enough to include interesting rules. Our proof uses the fact that this class of rewrite systems is known to be regularity-preserving and hence the reachability and joinability problems are decidable. Decidabil...

Two Procedures for Compiling Influence Diagrams

Two algorithms are presented for "compiling" influence diagrams into a set of simple decision rules. These decision rules define simple-to­ execute, complete, consistent, and near-�pti�al decision procedures. These compilation algorithms can be used to derive decision procedures for human teams solving time constrained decision problems.

A Method for Compiling Two-Level Rules with Multiple Contexts

A novel method is presented for compiling two-level rules which have multiple context parts. The same method can also be applied to the resolution of so-called right-arrow rule conflicts. The method makes use of the fact that one can efficiently compose sets of twolevel rules with a lexicon transducer. By introducing variant characters and using simple pre-processing of multi-context rules, all...

Implementing Hpsg with Modular Tools for Fast Compiling and Parsing

We describe a modular HPSG implementation , based on a set of tools rather than a single monolithic engine such as ALE. With these tools we can use techniques for much faster compiling and parsing than ALE. We use two-stage grammar compilation with partial execution and a concurrent process implementation of the chart for fast parsing. We compile HPSG lexical rules into Prolog rules used at run...